доказательство правильности программы
—
[http://www.iks-media.ru/glossary/index.html?glossid=2400324]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
Program derivation — In computer science, program derivation is the derivation of a program from its specification, by mathematical means.To derive a program means to write a formal specification, which is usually non executable, and then apply mathematically correct … Wikipedia
Correctness (computer science) — In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. Functional correctness refers to the input output behaviour of the algorithm (i.e., for each… … Wikipedia
Computer-assisted proof — A computer assisted proof is a mathematical proof that has been at least partially generated by computer. Most computer aided proofs to date have been implementations of large proofs by exhaustion of a mathematical theorem. The idea is to use a… … Wikipedia
доказательство правильности программы — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN program correctness proof … Справочник технического переводчика
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Structured programming — can be seen as a subset or subdiscipline of procedural programming, one of the major programming paradigms. It is most famous for removing or reducing reliance on the GOTO statement.Historically, several different structuring techniques or… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… … Wikipedia
Metamath — Developer(s) Norman Megill Written in C Operating system … Wikipedia
Richard Waldinger — Richard J. Waldinger is a computer science researcher at SRI Artificial Intelligence Laboratory (where he has worked since 1969) whose interests focus on the application of automated deductive reasoning to problems in software engineering and… … Wikipedia
Formal methods — In computer science and software engineering, formal methods are particular kind of mathematically based techniques for the specification, development and verification of software and hardware systems.cite web|author=R. W. Butler|title=What is… … Wikipedia
